Finitary 2-categories associated with dual projection functors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cell 2-representations of finitary 2-categories

We study 2-representations of finitary 2-categories with involution and adjunctions by functors on module categories over finite dimensional algebras. In particular, we define, construct and describe in detail (right) cell 2-representations inspired by KazhdanLusztig cell modules for Hecke algebras. Under some natural assumptions we show that cell 2-representations are strongly simple and do no...

متن کامل

Transitive 2-representations of Finitary 2-categories

In this article, we define and study the class of simple transitive 2-representations of finitary 2-categories. We prove a weak version of the classical Jordan-Hölder Theorem where the weak composition subquotients are given by simple transitive 2-representations. For a large class of finitary 2-categories we prove that simple transitive 2-representations are exhausted by cell 2-representations...

متن کامل

Recursive coalgebras of finitary functors

For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.

متن کامل

Morita Theory for Finitary 2-categories

We develop Morita theory for finitary additive 2-representations of finitary 2-categories. As an application we describe Morita equivalence classes for 2-categories of projective functors associated to finite dimensional algebras and for 2-categories of Soergel bimodules.

متن کامل

Coequational Logic for Finitary Functors

Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems wa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Contemporary Mathematics

سال: 2017

ISSN: 0219-1997,1793-6683

DOI: 10.1142/s0219199716500164